|
|
Artificial Intelligence for Strategy Games
Ščevik, Ľuboš ; Herout, Adam (referee) ; Matýšek, Michal (advisor)
This bachelor thesis deals with artificial intelligence for strategy games. To be able to demonstrate the AI, I also created a 2D real-time strategy game. The Monte Carlo method played a part in the creation of this AI. It started by generating plans for the AI, then plans for its opponent. It used these plans during the simulations of battles. In the end it chose the most effective plan, which was then implemented in the game. The game, along with artificial intelligence, was created in the Unity game engine.
|
|
| |
|
|
Algorithms for Tafl Games
Halmo, Kryštof ; Kočí, Radek (referee) ; Zbořil, František (advisor)
The goal for this work is to create a program witch allows the possibility to play some types of Tafle games against a some algorithms or against a other player. Algorithms used in the solution wear MCTS, Alfabeta and Minmax whit heurystyks which help to find a move faster and evaluate the game board whit specified parameters. Created solution allows the user to select the parameters for running this program. Results of this work provides a comparison between different types of Tafle games and the comparison of different types of algorithms agents one another.
|
|
|
Artificial Intelligence for Strategy Games
Ščevik, Ľuboš ; Herout, Adam (referee) ; Matýšek, Michal (advisor)
This bachelor thesis deals with artificial intelligence for strategy games. To be able to demonstrate the AI, I also created a 2D real-time strategy game. The Monte Carlo method played a part in the creation of this AI. It started by generating plans for the AI, then plans for its opponent. It used these plans during the simulations of battles. In the end it chose the most effective plan, which was then implemented in the game. The game, along with artificial intelligence, was created in the Unity game engine.
|
|
| |
|
|
Algorithms for Tafl Games
Halmo, Kryštof ; Kočí, Radek (referee) ; Zbořil, František (advisor)
The goal for this work is to create a program witch allows the possibility to play some types of Tafle games against a some algorithms or against a other player. Algorithms used in the solution wear MCTS, Alfabeta and Minmax whit heurystyks which help to find a move faster and evaluate the game board whit specified parameters. Created solution allows the user to select the parameters for running this program. Results of this work provides a comparison between different types of Tafle games and the comparison of different types of algorithms agents one another.
|
guest ::
